Critical value sets of generic mappings
نویسندگان
چکیده
منابع مشابه
Generic Schema Mappings
Schema mappings come in different flavors: simple correspondences are produced by schema matchers, intensional mappings are used for schema integration. However, the execution of mappings requires a formalization based on the extensional semantics of models. This problem is aggravated if multiple metamodels are involved. In this paper we present extensional mappings, that are based on second or...
متن کاملSets, Infinity, and Mappings
These notes discuss sets, mappings between sets, and the notion of countably infinite. This material supplements the lecture on countably and uncountably infinite sets in the EE 503 probability class. The material is useful because probability theory is defined over abstract sets, probabilities are defined as measures on subsets, and random variables are defined by mappings from an abstract set...
متن کاملEvaluation Sets and Mappings :
In this contribution, we study some aspects of the mathematical representation of the solutions of problems encountered in everyday life, called evaluation problems. These problems consist in having to check whether objects in a given universe satisfy one or more properties. First, evaluation problems under a single property are considered. It is argued that (partial-pre)order relations play a ...
متن کاملAnalytic Mappings on Hyperfinite Sets
Let S and T be hyperfinite sets in an N]-saturated nonstandard universe. The following are equivalent: m 1*1 ~ l (l) rff ~ • • (ii) There is a bijection from 5 onto T whose graph is Borel (over the internal subsets of S x T). This follows from somewhat more general results about analytic partial functions on hyperfinite sets, the proofs of which use Choquet's theorem on the capacitibility of an...
متن کاملOn Mathias Generic Sets
We present some results about generics for computable Mathias forcing. The n-generics and weak n-generics in this setting form a strict hierarchy as in the case of Cohen forcing. We analyze the complexity of the Mathias forcing relation, and show that if G is any n-generic with n ≥ 3 then it satisfies the jump property G(n−1) = G′ ⊕ ∅(n). We prove that every such G has generalized high degree, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1984
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1984.114.165